A New Generic Maximum-Likelihood Metric Expression for Space–Time Block Codes With Applications to Decoding

Space-time block codes with low maximum-likelihood decoding complexity

Hybrid Maximum Likelihood Decoding for Linear Block Codes

In this paper we propose a hybrid maximum likelihood decoding (MLD) for linear block codes. For the reliable data transmission over noisy channels, convolutional and block codes are widely used in most digital communication systems. Much more efficient algorithms have been found for using channel measurement information in the decoding of convolutional codes than in the decoding of block codes....

Adaptive Maximum-Likelihood Decoding Algorithms for Linear Block Codes

This correspondence represents two new soft decision decoding algorithms that promise to reduce complexity and at the same time achieve the maximum likelihood decoding (MLD) performance. The first method is an Adaptive Two-Stage Maximum Likelihood Decoder [1] that first estimates a minimum sufficient set and performs decoding within the smaller set to reduce complexity and at the same time achi...

Reduced Complexity Maximum Likelihood Decoding of Linear Block Codes

This paper proposes a reduced complexity Maximum-Likelihood (ML) decoding Algorithm for Linear Block Codes based on the Kaneko decoder and incorporating ruling out conditions for useless iteration steps. The proposed decoding scheme is evaluated over the Additive White Gaussian Noise (AGWN) channel using Binary Phase Shift Key (BPSK) signalling by simulation. Simulations results show that for n...

New Set of Codes for the Maximum-Likelihood Decoding Problem

The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is, codes that can be decoded through a polynomial time algorithm A whose decoding bound is beyond the covering radius. For these codes, we show that the maximum-likelihood decoding problem is reachable in polynomial tim...